Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity
نویسندگان
چکیده
منابع مشابه
Estimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity
Normalized Lempel-Ziv complexity, which measures the generation rate of new patterns along a digital sequence, is closely related to such important source properties as entropy and compression ratio, but, in contrast to these, it is a property of individual sequences. In this article, we propose to exploit this concept to estimate (or, at least, to bound from below) the entropy of neural discha...
متن کاملCharacterizing spike trains with Lempel-Ziv complexity
We review several applications of Lempel–Ziv complexity to the characterization of neural responses. In particular, Lempel–Ziv complexity allows to estimate the entropy of binned spike trains in an alternative way to the usual method based on the relative frequencies of words, with the de7nitive advantage of no requiring very long registers. We also use complexity to discriminate neural respons...
متن کاملEstimating the Entropy Rate of Spike Trains
Information-theoretic methods have been widely used in neuroscience, in the broad effort to analyze and understand the fundamental informationprocessing tasks performed by the brain. In these studies, the entropy has been adopted as the main measure for quantifying the amount of information transmitted between neurons, via the spike trains they generate. One of the first and most important goal...
متن کاملOn Efficient Entropy Approximation via Lempel-Ziv Compression
We observe a classical data compression algorithm due to Lempel and Ziv, well-known to achieve asymptotically optimal compression on a wide family of sources (stationary and ergodic), to perform reasonably well even on short inputs, provided the source is memoryless. More precisely, given a discrete memoryless source with large alphabet and entropy bounded away from zero, and a source sequence ...
متن کاملProperties of maximum Lempel-Ziv complexity strings
The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The non-stationary character of the MLZs are discussed. The issue of sensitiveness to noise is also addressed. An empirical ansatz is found that fits well to the L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2004
ISSN: 0899-7667,1530-888X
DOI: 10.1162/089976604322860677